Queueing Theory without Probabilities
نویسنده
چکیده
A. Udaya Shankar June 5, 1995
منابع مشابه
Analysis of the GIX/M/c model
In this paper, the GI X =M=c queueing model is analyzed. An explicit expression of the generating function of equilibrium probabilities of customer numbers in the system for the model is derived. Based on the generating function, it is proved that the equilibrium probabilities are given by a linear combination of some geometric terms. Due to this result, other interesting measures are also cons...
متن کاملPriority queueing systems: from probability generating functions to tail probabilities
Obtaining (tail) probabilities from a transform function is an important topic in queueing theory. To obtain these probabilities in discrete-time queueing systems, we have to invert probability generating functions, since most important distributions in discrete-time queueing systems can be determined in the form of probability generating functions. In this paper, we calculate the tail probabil...
متن کاملAn Integrated Queuing Model for Site Selection and Inventory Storage Planning of a Distribution Center with Customer Loss Consideration
Discrete facility location, Distribution center, Logistics, Inventory policy, Queueing theory, Markov processes, The distribution center location problem is a crucial question for logistics decision makers. The optimization of these decisions needs careful attention to the fixed facility costs, inventory costs, transportation costs and customer responsiveness. In this paper we stu...
متن کاملElementary Markov Queueing Systems with Unreliable Server
In the queueing theory we usually ignore the fact that utility server is often a technical device and its breakdown can occur. Common analytic models (see for example in [1] or [2]) assume that the server works reliably without failures causing its deficit. If failures of the server occur often and we would use an analytic model of reliable queueing system for modeling studied system, reached o...
متن کاملDiscrete Time Analysis of Multi-Server Queueing System with Multiple Working Vacations and Reneging of Customers
This paper analyzes a discrete-time $Geo/Geo/c$ queueing system with multiple working vacations and reneging in which customers arrive according to a geometric process. As soon as the system gets empty, the servers go to a working vacations all together. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. Customer...
متن کامل